#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;

struct Volunteers {
    void v_insert (int pos, int num) {
        data.insert(data.begin() + pos, num);
    }
    void v_delete (int num) {
        if (v_find(num))
        {
            auto p = find(data.begin(), data.end(), num);
            data.erase(p);
            return;
        }
        cout << "not found" << endl;
    }
    bool v_find (int num) {
        auto p = find(data.begin(), data.end(), num);
        if (p != data.end())
        {
            return 1;
        }
        return 0;
    }
    void v_print(){
        cout << "==" << endl;
        for (auto &a : data)
            cout << a << endl;
        cout << "==" << endl;
    }
    vector<int> data;
};
int main()
{
    Volunteers v;
    cout << "enter n" << endl;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        v.data.emplace_back(i);
    }
    v.v_print();
    v.v_insert(2, 100);
    v.v_print();
    v.v_delete(1);
    v.v_print();
    return 0;
}
